SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures

In this paper, we present a new diverse class of post-quantum group-based Digital Signature Schemes (DSS). The approach is significantly different from previous examples digital signatures and adopts the framework group action-based cryptography: show that each finite defines action relative to semidirect product by its automorphism group, give security bounds on resulting signature scheme in terms group-theoretic computational problem known as Semidirect Discrete Logarithm Problem (SDLP). Crucially, make progress towards being able efficiently compute novel action, an example parameterised family groups for which can be computed any parameters, thereby negating need expensive offline computation or inclusion redundancy required other schemes type.